High Priority Requests in Grid Environment
نویسندگان
چکیده
منابع مشابه
Scheduling of hard-aperiodic requests in dynamic priority systems
In this paper, we discuss the problem of jointly scheduling both hard deadline of periodic and aperiodic tasks in dynamic priority systems. The proposed scheduling scheme has extended the APS (Alternative Priority Scheduling) algorithm which is developed by the authors. The APS algorithm has a simple slcak calculation method which in consequence makes it be practical. The paper develops an effi...
متن کاملTransit signal priority accommodating conflicting requests under Connected Vehicles technology
In this research, a person-delay-based optimization method is proposed for an intelligent Transit Signal Priority (TSP) logic that resolves multiple conflicting TSP requests at an isolated intersection. This TSP with Connected Vehicles accommodating Conflicting Requests (TSPCV-CR) overcomes the challenge bore by the conventional ‘‘first come first serve” strategy and presents significant improv...
متن کاملAvoiding Priority Inversion on the Processing of Requests
We consider the priorit). inversion problem in an actively replicated system. Priority inversion was originally dejined in the context of non-replicated systems. Therefore we first introduce the concept of group priority inversion, which extends the concept of (local) priority inversion to the context of a group of processors that perform an actively replicated processing. We then present the p...
متن کاملScheduling in a grid environment using high level policies
Grid computing has been proposed as a solution to increasing computational demands for many organisations. Grids consist of a wide range of computational resources, and typically a wide range of diverse jobs. We consider the problem of controllability, the ability for the organisation to specify a policy controlling which users and organisational units receive the best service, whilst using a G...
متن کاملCo-Allocation with Collective Requests in Grid Systems
We present a new algorithm for resource allocation in large, heterogeneous grids. Its main advantage over existing co-allocation algorithms is that it supports collective requests with partial resource reservation, where the focus is on better grid utilisation. Alongside the requests that must be fulfilled by each resource, a collective request specifies the total amount of a required resource ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2020
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2020.0111032